POLY : A new polynomial data structure for Maple.
نویسندگان
چکیده
We demonstrate how a new data structure for sparse distributed polynomials in the Maple kernel significantly accelerates several key Maple library routines. The POLY data structure and its associated kernel operations (degree, coeff, subs, has, diff, eval, ...) are programmed for high scalability with very low overhead. This enables polynomial to have tens of millions of terms, increases parallel speedup in existing routines and dramatically improves the performance of high level Maple library routines.
منابع مشابه
Polynomial Factorization Challenges
Joachim von zur Gathen has proposed a challenge for factoring univariate poly-nomials over nite elds to evaluate the practicability of current factorization algorithms (\A Factorization Challenge", SIGSAM Bulletin 26(2):22-24, 1992). More recently, Victor Shoup has proposed an alternate family of polynomials with a similar goal in mind. Our eeort is to take these challenges on using the general...
متن کاملPolynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated merging. This results in poor performance on large sparse polynomials. In this paper we use an auxiliary heap of pointers to reduce the number of monomial comparisons in the worst case while keeping the overall storag...
متن کاملA Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases
In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...
متن کاملComputing Minimal Polynomial of Matrices over Algebraic Extension Fields
In this paper, we present a new and efficient algorithm for computing minimal polynomial of matrices over algebraic extension fields using the Gröbner bases technique. We have implemented our algorithm in Maple and we evaluate its performance and compare it to the performance of the function MinimalPolynomial of Maple 15 and also of the Bia las algorithm as a new algorithm to compute minimal po...
متن کاملStrongly Connected Graph Components and Computing Characteristic Polynomials of Integer Matrices in Maple
Let A be an n× n matrix of integers. We present details of our Maple implementation of a simple modular method for computing the characteristic polynomial of A. We consider several different representations for the computation modulo primes, in particular, the use of double precision floats. The algorithm used in Maple releases 7–10 is the Berkowitz algorithm. We present some timings comparing ...
متن کامل